Smaran: A Congruence-Closure Based System for Equational Computations

p. 1 Redundancy Criteria for Constrained Completion p. 2 Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations p. 17 A Case Study of Completion Modulo Distributivity and Abelian Groups p. 32 A Semantic Approach to Order-Sorted Rewriting p. 47 Distributing Equational Theorem Proving p. 62 On the Correctness of a Distributed Memory Grobner Basis Algorithm p. 77 Improving Transformation Systems for General E-Unification p. 92 Equational and Membership Constraints for Infinite Trees p. 106 Regular Path Expressions in Feature Logic p. 121 Proving Properties of Typed Lambda Terms: Realizability, Covers, and Sheaves p. 136 Some Lambda Calculi with Categorical Sums and Products p. 137 Paths, Computations and Labels in the [lambda]-Calculus p. 152 Confluence and Superdevelopments p. 168 Relating Graph and Term Rewriting via Bohm Models p. 183 Topics in Termination p. 198 Total Termination of Term Rewriting p. 213 Simple Termination is Difficult p. 228 Optimal Normalization in Orthogonal Term Rewriting Systems p. 243 A Graph Reduction Approach to Incremental Term Rewriting p. 259 Generating Tables for Bottom-up Matching p. 274 On Some Algorithmic Problems for Groups and Monoids p. 289 Combination Techniques and Decision Problems for Disunification p. 301 The Negation Elimination from Syntactic Equational Formula is Decidable p. 316 Encompassment Properties and Automata with Constraints p. 328 Recursively Defined Tree Transductions p. 343 AC-Complement Problems: Satisfiability and Negation Elimination p. 358 A Precedence-Based Total AC-Compatible Ordering p. 374 Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols p. 389